Search results for "quantum computer"

Quantum Computing Experiments with Cold Trapped Ions

2016

Ambainis-Freivalds’ Algorithm for Measure-Once Automata

2001

An algorithm given by Ambainis and Freivalds [1] constructs a quantum finite automaton (QFA) with O(log p) states recognizing the language Lp = {ai| i is divisible by p} with probability 1 - Ɛ , for any Ɛ > 0 and arbitrary prime p. In [4] we gave examples showing that the algorithm is applicable also to quantum automata of very limited size. However, the Ambainis-Freivalds algoritm is tailored to constructing a measure-many QFA (defined by Kondacs andWatrous [2]), which cannot be implemented on existing quantum computers. In this paper we modify the algorithm to construct a measure-once QFA of Moore and Crutchfield [3] and give examples of parameters for this automaton. We show for the lang…

Protecting quantum resources via frequency modulation of qubits in leaky cavities

2018

Finding strategies to preserve quantum resources in open systems is nowadays a main requirement for reliable quantum-enhanced technologies. We address this issue by considering structured cavities embedding qubits driven by a control technique known as frequency modulation. We first study a single qubit in a lossy cavity to determine optimal modulation parameters and qubit-cavity coupling regime allowing a gain of four orders of magnitude concerning coherence lifetimes. We relate this behavior to the inhibition of the qubit effective decay rate rather than to stronger memory effects (non-Markovianity) of the system. We then exploit these findings in a system of noninteracting qubits embedde…

Simultaneous readout of two charge qubits

2006

We consider a system of two solid state charge qubits, coupled to a single read-out device, consisting of a single-electron transistor (SET). The conductance of each tunnel junction is influenced by its neighboring qubit, and thus the current through the transistor is determined by the qubits' state. The full counting statistics of the electrons passing the transistor is calculated, and we discuss qubit dephasing, as well as the quantum efficiency of the readout. The current measurement is then compared to readout using real-time detection of the SET island's charge state. For the latter method we show that the quantum efficiency is always unity. Comparing the two methods a simple geometric…

Quantum computing thanks to Bianchi groups

2018

It has been shown that the concept of a magic state (in universal quantum computing: uqc) and that of a minimal informationally complete positive operator valued measure: MIC-POVMs (in quantum measurements) are in good agreement when such a magic state is selected in the set of non-stabilizer eigenstates of permutation gates with the Pauli group acting on it [1]. Further work observed that most found low-dimensional MICs may be built from subgroups of the modular group PS L(2, Z) [2] and that this can be understood from the picture of the trefoil knot and related 3-manifolds [3]. Here one concentrates on Bianchi groups PS L(2, O10) (with O10 the integer ring over the imaginary quadratic fie…

GENERATION OF ENTANGLED STATES OF TWO DISTANT CAVITY MODES VIA JOSEPHSON JUNCTION BASED DEVICES

2007

We present a simple scheme for the preparation of entangled states of the e.m. modes of two spatially separated microwave cavities exploiting their interaction with two superconducting SQUID rings embedded within them. The scheme requires that the two SQUID qubits are initially prepared in an entangled state and the possibility of controlling both the coupling strengths and the interaction times. We also briefly discuss the importance of such a theoretical scheme in view of possible applications in the context of quantum computing and its experimental feasibility.

Simulation of many-qubit quantum computation with matrix product states

2006

Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete problem. Errors inherent to truncations of the exact action of interacting gates are controlled by the size of the matrices in the representation. The property of finding the right solution for an instance and the expected value of the energy are found to be remarkably robust against these errors. As a symbolic example, we simulate the algorithm solving a 100-qubit hard instance, that is, finding the correct product state out of ~ 10^30 possibilities. Accum…

Entanglement replication in driven-dissipative many body systems

2012

We study the dissipative dynamics of two independent arrays of many-body systems, locally driven by a common entangled field. We show that in the steady state the entanglement of the driving field is reproduced in an arbitrarily large series of inter-array entangled pairs over all distances. Local nonclassical driving thus realizes a scale-free entanglement replication and long-distance entanglement distribution mechanism that has immediate bearing on the implementation of quantum communication networks.

Algebraic Results on Quantum Automata

2004

We use tools from the algebraic theory of automata to investigate the class of languages recognized by two models of Quantum Finite Automata (QFA): Brodsky and Pippenger’s end-decisive model, and a new QFA model whose definition is motivated by implementations of quantum computers using nucleo-magnetic resonance (NMR). In particular, we are interested in the new model since nucleo-magnetic resonance was used to construct the most powerful physical quantum machine to date. We give a complete characterization of the languages recognized by the new model and by Boolean combinations of the Brodsky-Pippenger model. Our results show a striking similarity in the class of languages recognized by th…

Fast SWAP gate by adiabatic passage

2005

We present a process for the construction of a SWAP gate which does not require a composition of elementary gates from a universal set. We propose to employ direct techniques adapted to the preparation of this specific gate. The mechanism, based on adiabatic passage, constitutes a decoherence-free method in the sense that spontaneous emission and cavity damping are avoided.